Dynamic index and LZ factorization in compressed space
نویسندگان
چکیده
منابع مشابه
Dynamic index, LZ factorization, and LCE queries in compressed space
In this paper, we present the following results: (1) We propose a new dynamic compressed index of O(w) space, that supports searching for a pattern P in the current text in O(|P | logw+logw log |P | logN(log M)+occ logN) time and insertion/deletion of a substring of length y in O((y + logN log M) logw logN log M) time, where N is the length of the current text, M is the maximum length of the dy...
متن کاملDynamic Index and LZ Factorization in Compressed Space
In this paper, we propose a new dynamic compressed index of O(w) space for a dynamic text T , where w = O(min(z logN log M,N)) is the size of the signature encoding of T , z is the size of the Lempel-Ziv77 (LZ77) factorization of T , N is the length of T , and M ≥ 3N is an integer that can be handled in constant time under word RAM model. Our index supports searching for a pattern P in T in O(|...
متن کاملCompressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space
The dynamic trie is a fundamental data structure which finds applications in many areas. This paper proposes a compressed version of the dynamic trie data structure. Our data-structure is not only space efficient, it also allows pattern searching in o(|P |) time and leaf insertion/deletion in o(log n) time, where |P | is the length of the pattern and n is the size of the trie. To demonstrate th...
متن کاملReducing the Space Requirement of LZ-Index
The LZ-index is a compressed full-text self-index able to represent a text T1...u, over an alphabet of size σ = O(polylog(u)) and with k-th order empirical entropy Hk(T ), using 4uHk(T )+ o(u logσ) bits for any k = o(logσ u). It can report all the occ occurrences of a pattern P1...m in T in O(m3 logσ +(m + occ) log u) worst case time. Its main drawback is the factor 4 in its space complexity, w...
متن کاملSpace-Efficient Construction of LZ-Index
A compressed full-text self-index is a data structure that replaces a text and in addition gives indexed access to it, while taking space proportional to the compressed text size. The LZ-index, in particular, requires 4uHk(1 + o(1)) bits of space, where u is the text length in characters and Hk is its k-th order empirical entropy. Although in practice the LZ-index needs 1.0-1.5 times the text s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2020
ISSN: 0166-218X
DOI: 10.1016/j.dam.2019.01.014